A Set-Theoretic Approach to Modeling Network Structure

Three computer algorithms are presented. One reduces a network N to its interior, I. Another counts all the triangles in network, and last randomly generates networks similar given just interior However, these not usual numeric programs that manipulate matrix representation of network; they set-based. Union meet essential binary operators; contained_in is basic relational comparator. The I shown have desirable formal properties provide an effective way revealing “communities” social networks. A series generated from compared with original N.